No oculomotor final comon path

H . Comon − Lundh

Montgomery Exponentiation Needs No Final Subtractions

Montgomery’s modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. We observe that there is no need for extra cleaning up at the end of an exponentiation if the method is set up in the right way.

Contract No F61775-02-WE010: Final Report

1. We have developed a new hybrid technique embedding a quantum description of point defects in SiO2 inside a classical model of the infinite solid. Thus, we incorporate accurately long-range effects (lattice relaxations and dielectric effects). Whilst embedding has been employed previously in highly ionic systems, such as the alkali halides, this is the first successful implementation in a mix...

No . KSL – 96 – 25 Guardian : Final Evaluation

Guardian is a knowledge-based system for monitoring and diagnosis of post-cardiac surgery patients in an intensive-care unit. It is designed as an autonomous agent with a flexible architecture in which several different algorithms cooperate to reach diagnoses under hard realtime conditions. Guardian has been subjected to several different test experiments, and its performance has been compared ...

Shortest Path Computation with No Information Leakage

Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client’s position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing metho...